A New Algorithm for Extraction of Continuous Channel Networks without Problematic Parallels from Hydrologically Corrected Dems

ثبت نشده
چکیده

One of the most popular flow-routing approaches to the extraction of channel networks from DEMs is the D8 approach. Several algorithms based on this method have been developed so far, but none provides a satisfactory solution to the problem of parallel lines. In this study, a new algorithm named DRainage Axis Way (DRAW) is developed. It has seven core routines, and three of them are similar to the Profile Recognition and Polygon Breaking Algorithm (PPA). It is a segment based computation system, but it uses flow accumulation data as well. It works on hydrologically corrected DEMs. In DRAW, the flow accumulation threshold value is determined automatically with respect to the occurrence of parallel lines depending on terrain forms. For experimental testing, two hydrologically corrected 5 m DEMs were used. Four sets of channel networks were extracted from the DEMs by using PPA, D8 with two different stream thresholds, and DRAW. For comparison, an existing channel network on a map with a scale of 1:5,000 was utilized as a ground-truth.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks

Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...

متن کامل

Optimal SVD-based Precoding for Secret Key Extraction from Correlated OFDM Sub-Channels

Secret key extraction is a crucial issue in physical layer security and a less complex and, at the same time, a more robust scheme for the next generation of 5G and beyond. Unlike previous works on this topic, in which Orthogonal Frequency Division Multiplexing (OFDM) sub-channels were considered to be independent, the effect of correlation between sub-channels on the secret key rate is address...

متن کامل

Securing AODV routing protocol against the black hole attack using Firefly algorithm

Mobile ad hoc networks are networks composed of wireless devices to create a network with the ability for self-organization. These networks are designed as a new generation of computer networks to satisfy some specific requirements and with features different from wired networks. These networks have no fixed communication infrastructure and for communication with other nodes the intermediate no...

متن کامل

A New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks

In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...

متن کامل

A New Algorithm for Load Flow Analysis in Autonomous Networks

In this paper, a novel algorithm for the load flow analysis problem in an islanded microgrid is proposed. The problem is modeled without any slack bus by considering the steady state frequency as one of the load flow variables. To model different control modes of DGs, such as droop, PV and PQ, in an islanded microgrid, a new formula for load flow equations is proposed. A hybrid optimization alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010